package problems.solved;

import java.util.HashSet;
import java.util.Set;

public class Problem73 {
	private static final double low = 1d/3;
	private static final double high = 1d/2;
	
	private static final int D_LIMIT = 12000;

	public static void main(String[] args) {
		Set<Double> set = new HashSet<Double>();
		for (int d = 2; d <= D_LIMIT; d++) {
			for (int n = 1; n*2 < d; n++) {
				double frac = (double)n/d;
				if (frac < high && frac > low) {
					set.add(frac);
				}
			}
		}
		System.out.println(set.size()); // 7295372
	}
}
